Italian Ministry for Education, University

Temporal reasoning is an important topic in AI and Computer Science, comprising well-practiced problems such as planning and scheduling; more recently, also hardware verification problems have been cast in this framework. Efficient decision procedures for Temporal Reasoning are, therefore, strongly needed; at the same time, more and more expressivity is required. In this paper we present the temporal reasoning techniques built into TSAT++, an open reasoning platform able to decide the satisfiability of Boolean combinations of linear binary constraints and propositional variables. The experimental results show that TSAT++ outperforms its competitors both on randomly-generated problems and on real-world instances taken from the computer-aided verification literature.